Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets
نویسندگان
چکیده
We prove Erdős-Ko-Rado and Hilton-Milner type theorems for t-intersecting k-chains in posets using the kernel method. These results are common generalizations of the original EKR and HM theorems, and our earlier results for intersecting k-chains in the Boolean algebra. For intersecting k-chains in the c-truncated Boolean algebra we also prove an exact EKR theorem (for all n) using the shift method. An application of the general theorem gives a similar result for t-intersecting chains if n is large enough.
منابع مشابه
Maximum Hitting of a Set by Compressed Intersecting Families
For a family A and a set Z , denote {A ∈ A : A ∩ Z = ∅} by A(Z). For positive integers n and r , let Sn,r be the trivial compressed intersecting family {A ∈ ([n] r ) : 1 ∈ A}, where [n] := {1, . . . , n} and ([n] r ) := {A ⊂ [n] : |A| = r}. The following problem is considered: For r ≤ n/2, which sets Z ⊆ [n] have the property that |A(Z)| ≤ |Sn,r (Z)| for any compressed intersecting family A ⊂ (...
متن کامل1 - Introduction to hypergraphs
We begin with an introduction to hypergraphs, which gives a taste of different representations of hypergraphs, linear hypergraphs, and Turán-type problems, including existence of Turán densities and classification of zero Turán densities. Thereafter we delve deeper into some of the classical theorems of hypergraph theory, including various theorems on intersecting families such as Sperner’s The...
متن کاملA degree version of the Hilton-Milner theorem
An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erdős–Ko–Rado theorem: when n > 2k, every non-trivial intersecting family of k-subsets of [n] has at most (n−1 k−1 ) − (n−k−1 k−1 ) + 1 members. One extremal family HMn,k consists of a k-set S and all k-subsets of [n] containing a fixed el...
متن کاملErdös-Ko-Rado theorems for chordal and bipartite graphs
One of the more recent generalizations of the Erdös-Ko-Rado theorem, formulated by Holroyd, Spencer and Talbot [10], de nes the Erdös-Ko-Rado property for graphs in the following manner: for a graph G, vertex v ∈ G and some integer r ≥ 1, denote the family of independent r-sets of V (G) by J (r)(G) and the subfamily {A ∈ J (r)(G) : v ∈ A} by J (r) v (G), called a star. Then, G is said to be r-E...
متن کاملErdös-Ko-Rado-Type Theorems for Colored Sets
An Erdős-Ko-Rado-type theorem was established by Bollobás and Leader for q-signed sets and by Ku and Leader for partial permutations. In this paper, we establish an LYM-type inequality for partial permutations, and prove Ku and Leader’s conjecture on maximal k-uniform intersecting families of partial permutations. Similar results on general colored sets are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorica
دوره 20 شماره
صفحات -
تاریخ انتشار 2000